Read-Once Branching Programs for Tree Evaluation Problems
نویسندگان
چکیده
منابع مشابه
Read-Once Branching Programs for Tree Evaluation Problems
Toward the ultimate goal of separating L and P, Cook, McKenzie, Wehr, Braverman and Santhanam introduced the tree evaluation problem (TEP). For fixed h, k > 0, FTh(k) is given as a complete, rooted binary tree of height h, in which each internal node is associated with a function from [k]2 to [k], and each leaf node with a number in [k]. The value of an internal node v is defined naturally, i.e...
متن کاملClassical vs. Quantum Read-Once Branching Programs
A simple, explicit boolean function on 2n input bits is presented that is computable by errorfree quantum read-once branching programs of size O(n), while each classical randomized read-once branching program and each quantum OBDD for this function with bounded twosided error requires size 2.
متن کاملQuantum vs. Classical Read-Once Branching Programs
The paper presents the first nontrivial upper and lower bounds for (nonoblivious) quantum read-once branching programs. It is shown that the computational power of quantum and classical read-once branching programs is incomparable in the following sense: (i) A simple, explicit boolean function on 2n input bits is presented that is computable by error-free quantum read-once branching programs of...
متن کاملOn Nondeterminism versus Randomness for Read-Once Branching Programs
Randomized branching programs are a probabilistic model of computation defined in analogy to the well-known probabilistic Turing machines. In this paper, we present complexity theoretic results for randomized read-once branching programs. Our main result shows that nondeterminism can be more powerful than randomness for read-once branching programs. We present a function which is computable by ...
متن کاملRandomness and Nondeterminism are Incomparable for Read-Once Branching Programs
We extend the tools for proving lower bounds for randomized branching programs by presenting a new technique for the read-once case which is applicable to a large class of functions. This technique fills the gap between simple methods only applicable for OBDDs and the well-known “rectangle technique” of Borodin, Razborov and Smolensky which works for the quite general models of nondeterministic...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM Transactions on Computation Theory
سال: 2019
ISSN: 1942-3454,1942-3462
DOI: 10.1145/3282433